class Solution {
public:
    vector<vector<int>> threeSum(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        vector<vector<int>> ret;

        for (int i = 0; i < nums.size();)
        {
            if (nums[i] > 0)
            {
                break;
            }
            int left = i + 1;
            int right = nums.size() - 1;
            int anw = -nums[i];
            while (left < right)
            {
                int sum = nums[left] + nums[right];
                if (sum > anw)
                {
                    right--;
                }
                else if (sum < anw)
                {
                    left++;
                }
                else
                {
                    ret.push_back({ nums[i],nums[left],nums[right] });
                    left++;
                    right--;
                    while (left < right && nums[left] == nums[left - 1])left++;
                    while (left < right && nums[right] == nums[right + 1])right--;

                }
            }

            i++;
            while (i < nums.size() && nums[i] == nums[i - 1])i++;
        }
        return ret;
    }
};